Some remarks on the survey decimation algorithm for K-satisfiability
نویسنده
چکیده
In this note we study the convergence of the survey decimation algorithm. An analytic formula for the reduction of the complexity during the decimation is derived. The limit of the converge of the algorithm are estimated in the random case: interesting phenomena appear near the boundary of convergence.
منابع مشابه
Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem
We show that the Survey Propagation guided decimation algorithm fails to find satisfying assignments on random instances of the “Not-All-Equal-K-SAT” problem, well below the satisfiability threshold. Our analysis applies to a broad class of algorithms that may be described as “sequential local algorithms” — such algorithms iteratively set variables based on some local information and/or local r...
متن کاملOn the Probabilistic Approach to the Random Satisfiability Problem
In this note I will review some of the recent results that have been obtained in the probabilistic approach to the random satisfiability problem. At the present moment the results are only heuristic. In the case of the random 3-satisfiability problem a phase transition from the satisfiable to the unsatisfiable phase is found at α = 4.267. There are other values of α that separates different reg...
متن کاملAnalysing Survey Propagation Guided Decimationon Random Formulas
Let ~ Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. For clauses/variables ratio m/n ≤ rk-SAT ∼ 2 ln 2 the formula ~ Φ is satisfiable with high probability. However, no efficient algorithm is known to provably find a satisfying assignment beyond m/n ∼ 2k ln(k)/k with a non-vanishing probability. Non-rigorous statistical mechanics work on k-CNF led to the devel...
متن کاملSurvey propagation applied to weighted partial maximum satisfiability
We adapt the survey propagation method for application to weighted partial maximum satisfiability (WPMax-SAT) problems consisting of a mixture of hard and soft clauses. The aim is to find the truth assignment that minimises the total cost of unsatisfied soft clauses while satisfying all hard clauses. We use fixed points of the new set of message passing equations in a decimation procedure to re...
متن کاملAn Existence Results on Positive Solutions for a Remarks on k-Torsionless Modules
Let R be a commutative Noetherian ring. The k-torsionless modules are defined in [7] as a generalization of torsionless and reflexive modules, i.e., torsionless modules are 1-torsionless and reflexive modules are 2-torsionless. Some properties of torsionless, reflexive, and k-torsionless modules are investigated in this paper. It is proved that if M is an R-module such that G-dimR(M)
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.CC/0301015 شماره
صفحات -
تاریخ انتشار 2003